Parallel Prefix on Mesh of Trees and OTIS Mesh of Trees
نویسندگان
چکیده
$ The corresponding author, Member, IEEE and IEEE Computer Society Abstract: In this paper, we first develop a parallel algorithm for prefix computation on an n × n mesh of trees (MOT). For n data elements, the algorithm requires 4 log n + O(1) time using n2 processors. Using the MOT prefix, we next propose a prefix algorithm on an n × n OTIS mesh of trees. This algorithm for n4 data elements is shown to map in 13 log n + O(1) electronic moves + 2 OTIS moves using n processors.
منابع مشابه
Improved Parallel Prefix Algorithm on OTIS-Mesh of Trees
A parallel algorithm for prefix computation reported recently on interconnection network called OTIS-Mesh Of Trees[4]. Using n4 processors, algorithm shown to run in 13log n + O(1) electronic moves and 2 optical moves for n4 data points. In this paper we present new and improved parallel algorithm for prefix on OTIS-Mesh of Trees. The algorithm requires 10log n + O(1) electronic steps + 1 optic...
متن کاملComputational Geometry On The OTIS-Mesh Optoelectronic Computer
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...
متن کاملImproved Parallel Algorithm for Time Series Based Forecasting Using OTIS-Mesh
Forecasting always plays an important role in business, technology and many others and it helps organizations to increase profits, reduce lost sales and more eff icient production planning. A parallel algorithm for forecasting reported recently on OTIS-Mesh[9]. This parallel algorithm requires 5( – 1) electronic steps and 4 optical steps. In this paper we present an improved parallel algorithm ...
متن کاملMicrosoft Word - camera
Multi-Mesh of Trees (MMT) is an efficient interconnection network for massively parallel processing system. This network is a hybrid product of multi-mesh and mesh of trees. Many interesting topological properties and various algorithms have been developed on this architecture. In this paper, we propose an algorithm for shortest path routing on an nprocessor multi-mesh of trees network. The pro...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کامل